A general branch-and-bound framework for continuous global multiobjective optimization

نویسندگان

چکیده

Abstract Current generalizations of the central ideas single-objective branch-and-bound to multiobjective setting do not seem follow their train thought all way. The present paper complements various suggestions for partial lower bounds and overall upper by general constructions from bounds, corresponding termination criteria node selection steps. In particular, our concept employs a new enclosure set nondominated points union boxes. On this occasion we also suggest discarding test based on linearization technique. We provide convergence proof framework illustrate results with numerical examples.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A General Framework for Convexity Analysis and an Alternative to Branch and Bound in Deterministic Global Optimization

To date, complete search in deterministic global optimization has been based on branch and bound techniques, with the bounding often done with linear or convex relaxations of the original non-convex problem. Here, we present an alternative, inspired by talks of Ch. Floudas. In this alternative, a set of non-convex variables, chosen from the intermediate variables in the expressions for the obje...

متن کامل

A branch and bound method for stochastic global optimization

A stochastic version of the branch and bound method is proposed for solving stochastic global optimization problems. The method, instead of deterministic bounds, uses stochastic upper and lower estimates of the optimal value of subproblems, to guide the partitioning process. Almost sure convergence of the method is proved and random accuracy estimates derived. Methods for constructing random bo...

متن کامل

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and ...

متن کامل

A general framework for evolutionary multiobjective optimization via manifold learning

Under certain mild condition, the Pareto-optimal set (PS) of a continuous multiobjective optimization problem, with m objectives, is a piece-wise continuous (m 1)-dimensional manifold. This regularity property is important, yet has been unfortunately ignored in many evolutionary multiobjective optimization (EMO) studies. The first work that explicitly takes advantages of this regularity propert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2021

ISSN: ['1573-2916', '0925-5001']

DOI: https://doi.org/10.1007/s10898-020-00984-y